#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
struct Node
{
    int s,si;
    bool o,f;
};
bool cmp(Node a,Node b)
{
    return a.s<b.s;
}
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    int cnt=n;
    Node *a=new Node [n+1];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].s;
        a[i].o=1;
        a[i].f=1;
        a[i].si=i;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1,j=2;i<=n&&j<=n;)
    {
        if(a[j].s>a[i].s&&a[j].o&&a[i].o&&a[j].f)
        {
            a[i].o=0;
            a[j].f=0;
            cnt--;
            i++;
        }
        else
        {
            j++;
            if(j<=i)
            {
                i=j-1;
            }
        }
    }
    cout<<cnt;
    return 0;
}
